Identity Graph of Finite Cyclic Groups

نویسندگان

چکیده

This paper discusses how to express a finite group as graph, specifically about the identity graph of cyclic group. The term chosen for is an because it element that holds key in forming graph. Through can be seen which elements are inverse themselves and other properties We will look characteristics group, both cases odd even order.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite $p$-groups and centralizers of non-cyclic abelian subgroups

A $p$-group $G$ is called a $mathcal{CAC}$-$p$-group if $C_G(H)/H$ is ‎cyclic for every non-cyclic abelian subgroup $H$ in $G$ with $Hnleq‎ ‎Z(G)$‎. ‎In this paper‎, ‎we give a complete classification of‎ ‎finite $mathcal{CAC}$-$p$-groups‎.

متن کامل

A Kind of Non-commuting Graph of Finite Groups

Let g be a fixed element of a finite group G. We introduce the g-noncommuting graph of G whose vertex set is whole elements of the group G and two vertices x,y are adjacent whenever [x,y] g  and  [y,x] g. We denote this graph by . In this paper, we present some graph theoretical properties of g-noncommuting graph. Specially, we investigate about its planarity and regularity, its clique number a...

متن کامل

Finite groups all of whose proper centralizers are cyclic

‎A finite group $G$ is called a $CC$-group ($Gin CC$) if the centralizer of each noncentral element of $G$ is cyclic‎. ‎In this article we determine all finite $CC$-groups.

متن کامل

subgroup intersection graph of finite abelian groups

let $g$ be a finite group with the identity $e$‎. ‎the subgroup intersection graph $gamma_{si}(g)$ of $g$ is the graph with vertex set $v(gamma_{si}(g)) = g-e$ and two distinct vertices $x$ and $y$ are adjacent in $gamma_{si}(g)$ if and only if $|leftlangle xrightrangle capleftlangle yrightrangle|>1$‎, ‎where $leftlangle xrightrangle $ is the cyclic subgroup of $g$ generated by $xin g$‎. ‎in th...

متن کامل

Finite groups admitting a connected cubic integral bi-Cayley graph

A graph   is called integral if all eigenvalues of its adjacency matrix  are integers.  Given a subset $S$ of a finite group $G$, the bi-Cayley graph $BCay(G,S)$ is a graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid sin S, xin G}$.  In this paper, we classify all finite groups admitting a connected cubic integral bi-Cayley graph.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Applied Sciences and Smart Technologies

سال: 2021

ISSN: ['2655-8564', '2685-9432']

DOI: https://doi.org/10.24071/ijasst.v3i1.3256